A Sierpiński Graph and Some of its Properties
نویسندگان
چکیده
The Sierpiński fractal or Sierpiński gasket Σ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph Sn derived from the first n iterations of the process that leads to Σ, and study some of its properties, including its cycle structure, domination number and pebbling number. Various open questions are posed.
منابع مشابه
Properties of extended ideal based zero divisor graph of a commutative ring
This paper deals with some results concerning the notion of extended ideal based zero divisor graph $overline Gamma_I(R)$ for an ideal $I$ of a commutative ring $R$ and characterize its bipartite graph. Also, we study the properties of an annihilator of $overline Gamma_I(R)$.
متن کاملThe Structural Relationship Between Topological Indices and Some Thermodynamic Properties
The fact that the properties of a molecule are tightly connected to its structural characteristics is one of the fundamental concepts in chemistry. In this connection, graph theory has been successfully applied in developing some relationships between topological indices and some thermodynamic properties. So , a novel method for computing the new descriptors to construct a quantitative rela...
متن کاملm-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملSome properties and domination number of the complement of a new graph associated to a commutative ring
In this paper some properties of the complement of a new graph associated with a commutative ring are investigated ....
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004